Eigenvalue-based algorithms for testing positive realness of SISO systems
نویسندگان
چکیده
In control and circuit theory it is important to test if the given transfer function is positive real. In this paper an efficient computational procedure for testing if a given transfer function in discrete-time is positive real is presented. The algorithm is based on the continuous-time case and uses only standard matrix computations. The input for these tests is the state-space representation of the linear system.
منابع مشابه
Robust Fractional Adaptive Control Based on the Strictly Positive Realness Condition
This paper presents a new approach to robust adaptive control, using fractional order systems as parallel feedforward in the adaptation loop. The problem is that adaptive control systems may diverge when confronted with finite sensor and actuator dynamics, or with parasitic disturbances. One of the classical robust adaptive control solutions to these problems makes use of parallel feedforward a...
متن کاملMatrix Inequality Characterizations for Positive Realness of Descriptor Systems
In this talk, matrix inequality characterizations for the positive realness of descriptor systems are introduced. Hence, the celebrated positive real lemma for standard state space systems is established for descriptor systems. In addition, the lossless positive realness of both standard state space systems and descriptor systems are characterized explicitly based on the controllable staircase ...
متن کاملAn extension of the positive real lemma to descriptor systems
The well-known positive real lemma characterizes positive realness of transfer functions of timeinvariant linear systems via the solvability of certain linear matrix inequalities. In this paper, we propose an extension of the positive real lemma and the underlying linear matrix inequalities to descriptor systems. We show that the solvability of these linear matrix inequalities is sufficient and...
متن کاملA mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices
In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...
متن کاملIdentifying Positive Real Models in Subspace Identification by Using Regularization
This paper deals with the lack of positive realness of identified models that may be encountered in many stochastic subspace identification procedures. Lack of positive realness is an often neglected, but important problem. Subspace identification algorithms fail to return a valid linear model if the so-called covariance model, which is obtained from an intermediate realization step in the subs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Automat. Contr.
دوره 48 شماره
صفحات -
تاریخ انتشار 2003